Batch Recovery of Multiple Views with Missing Data Using Direct Sparse Solvers

نویسندگان

  • Nicolas Guilbert
  • Adrien Bartoli
چکیده

Using the so-called closure constraints, it is possible to estimate the projection matrices of the cameras observing a static scene given correspondences between multiple views. We present a batch algorithm for recovering all the cameras based on the closure constraints. The approach is motivated by the necessity of including as much information as possible in the initial recovery of the motion, as is done in factorisation schemes. The main advantage of the proposed method over factorisation is that it naturally deals with missing data. Compared to other algorithms, the method is very fast and flexible in terms of the selection of input data.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Domain Decomposition Based High Performance Parallel Computing

The study deals with the parallelization of finite element based Navier-Stokes codes using domain decomposition and state-ofart sparse direct solvers. There has been significant improvement in the performance of sparse direct solvers. Parallel sparse direct solvers are not found to exhibit good scalability. Hence, the parallelization of sparse direct solvers is done using domain decomposition t...

متن کامل

Sparse Model and Sparse Recovery with Ultra-wideband SAR Applications

This paper presents a simple yet very effective timedomain sparse representation and the associated sparse recovery techniques that can robustly capture raw ultra-wideband (UWB) synthetic aperture radar (SAR) records. Unlike previous approaches in compressed sensing for SAR, we take advantage of the sparsity and the correlation directly in the raw received pulses before even attempting image fo...

متن کامل

Adaptive Variable Step Algorithm for Missing Samples Recovery in Sparse Signals

Recovery of arbitrarily positioned samples that are missing in sparse signals recently attracted significant research interest. Sparse signals with heavily corrupted arbitrary positioned samples could be analyzed in the same way as compressive sensed signals by omitting the corrupted samples and considering them as unavailable during the recovery process. The reconstruction of missing samples i...

متن کامل

Recovering Joint and Individual Components in Facial Data

A set of images depicting faces with different expressions or in various ages consists of components that are shared across all images (i.e., joint components) imparting to the depicted object the properties of human faces as well as individual components that are related to different expressions or age groups. Discovering the common (joint) and individual components in facial images is crucial...

متن کامل

Extreme-Speed Scalable Direct Sparse Solvers for Heterogeneous Supercomputing –An Enhancement to the LAPACKrc Library

At the core of DOE’s scientific priorities is a broad need for more computing power and supercomputing infrastructure. An estimated 70% of computing cycles spent globally in the HPC ecosystem are used to solve large-scale linear algebra computational problems. Linear algebra is at the core and constitutes the primary bottleneck of important DOE research problems in fusion energy, nuclear accele...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003